home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
The Arsenal Files 8
/
The Arsenal Files Collection #8 (Arsenal Computer) (1996).ISO
/
prg_casm
/
snpd9611.zip
/
CRC.TXT
< prev
next >
Wrap
Text File
|
1996-11-24
|
1KB
|
65 lines
.I 0 2
+++Date last modified: 07-Nov-1995
.I 31 1
4. Polynomial Arithmetic
.D 32 1
.I 182 1
Example: Suppose the message consisted of the two bytes (6,23) as
.D 183 1
.I 250 2
4. Polynomial Arithmetic
.D 251 1
.I 339 1
Thus polynomial arithmetic mod 2 is just binary arithmetic mod 2 with
.D 340 1
.I 494 1
.I 593 1
.I 669 1
.I 674 1
tricks at all. We'll then transform that program progressively until we
.D 675 1
.I 682 1
might be ten megabytes long, and today's processors do not have
.D 683 1
.I 696 1
the poly=10111. Then, to perform the division, we need to use a 4-bit
.D 697 1
.I 842 2
While (augmented message is not exhausted)
Begin
.D 843 2
.I 898 1
.I 1128 2
.I 1131 1
concept kicking around which makes the situation bizarrely confusing.
.D 1132 1
.I 1216 1
to be able to define them more precisely than this. For this reason, the
.D 1217 1
.I 1312 1
.I 1459 1
/* header file, rendering it idempotent. */
.D 1460 1
.I 1705 1
.I 1966 1
.I 2001 1
WIDTH - The width of a CRC algorithm is the width of its polynomial
.D 2002 1
.I 2005 1
.I 2011 2
The technique seems to be a touch messy, and is superseded by the
Sarwate algorithm.
.D 2012 2